A New Rose : The First Simple Symmetric 11-Venn Diagram
نویسندگان
چکیده
A symmetric Venn diagram is one that is invariant under rotation, up to a relabeling of curves. A simple Venn diagram is one in which at most two curves intersect at any point. In this paper we introduce a new property of Venn diagrams called crosscut symmetry, which is related to dihedral symmetry. Utilizing a computer search restricted to crosscut symmetry we found many simple symmetric Venn diagrams with 11 curves. This answers an existence question that has been open since the 1960’s. The first such diagram that was discovered is shown here.
منابع مشابه
New Roses: Simple Symmetric Venn Diagrams with 11 and 13 Curves
A symmetric n-Venn diagram is one that is invariant under n-fold rotation, up to a relabeling of curves. A simple n-Venn diagram is an n-Venn diagram in which at most two curves intersect at any point. In this paper, we introduce a new property of Venn diagrams called crosscut symmetry, which is related to dihedral symmetry. Utilizing a computer search restricted to diagrams with crosscut symme...
متن کاملVenn Diagrams and Symmetric Chain Decompositions in the Boolean Lattice Preliminary Draft
In this paper we show that symmetric Venn diagrams for n sets exist for every prime n, settling an open question. Until this time, n = 11 was the largest prime for which the existence of such diagrams had been proven. We show that the problem can be reduced to finding a symmetric chain decomposition, satisfying a certain cover property, in a subposet of the Boolean lattice Bn, and prove that su...
متن کاملDoodles and doilies, non-simple symmetric Venn diagram
In this paper we create and implement a method to construct a non-simple, symmetric 11-Venn diagram. By doing this we answer a question of Gr unbaum. Daniel Kleitman's mathematics seems to be remote from this area, but in fact, his results inspired this solution, which holds promise of settling the general case for all prime numbers, and the promise to nd simple doilies with 11 and more curves...
متن کاملSymmetric Monotone Venn Diagrams with Seven Curves
An n-Venn diagram consists of n curves drawn in the plane in such a way that each of the 2 possible intersections of the interiors and exteriors of the curves forms a connected non-empty region. A k-region in a diagram is a region that is in the interior of precisely k curves. A n-Venn diagram is symmetric if it has a point of rotation about which rotations of the plane by 2π/n radians leaves t...
متن کاملWhich n-Venn diagrams can be drawn with convex k-gons?
We establish a new lower bound for the number of sides required for the component curves of simple Venn diagrams made from polygons. Specifically, for any n-Venn diagram of convex k-gons, we prove that k ≥ (2 − 2 − n)/(n(n − 2)). In the process we prove that Venn diagrams of seven curves, simple or not, cannot be formed from triangles. We then give an example achieving the new lower bound of a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1207.6452 شماره
صفحات -
تاریخ انتشار 2012